package com.shuzijun.leetcode.editor.cn;
public class MinimumPathSum{
    public static void main(String[] args) {
         Solution solution = new MinimumPathSum().new Solution();
    }
    //leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int minPathSum(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
        int[][] dp = new int[m][n];
        int len = 0;
        for (int i = 0; i < m; i++) {
            len += grid[i][0];
            dp[i][0] = len;
        }

        len = 0;
        for (int j = 0; j < n; j++) {
            len += grid[0][j];
            dp[0][j] = len;
        }

        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = Math.min(dp[i-1][j],dp[i][j-1]+grid[i][j]);
            }
        }
        return dp[m-1][n-1];
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}